Space Complexity of Operational Semantics for the LogicGuard Core Language
نویسنده
چکیده
In this work we provide a space complexity analysis of the core language of the LogicGuard framework. Our approach is to abstract away from the formula structure of the core language in order to construct invariants for a recursive function. This final recursive function provided an upper bound for the number of instances of the monitor that need to be kept in memory over any duration of time. ∗Supported by the Austrian Research Promotion Agency (FFG) in the frame of the BRIDGE program by the projects 832207 “LogicGuard” and 846003 “LogicGuard II”.
منابع مشابه
EPiC Series in Computing
We analyze the space complexity of monitoring streams of messages whose expected behavior is specified in a fragment of predicate logic; this fragment is the core of the LogicGuard specification language that has been developed in an industrial context for the runtime monitoring of network traffic. The execution of the monitors is defined by an operational semantics for the step-wise evaluation...
متن کاملSpace Complexity of LogicGuard Revisited
We analyse the space complexity of specific formula structures constructed using the core language of the LogicGuard framework. Unlike previous analysis which focused on the local space complex around a single quantifier, in this work we fix the global structure of the formula enough to allow analysis as a whole. Though we end up with precise results for two very specific cases, we show that th...
متن کاملPredicting Space Requirements for a Stream Monitor Specification Language
The LogicGuard specification language for the runtime monitoring of message/event streams specifies monitors by predicate logic formulas of a certain kind. In this paper we present an algorithm that gives upper bounds for the space requirements of monitors specified in a formally elaborated core of this language. This algorithm has been implemented in the LogicGuard software and experiments hav...
متن کاملSemantics for Communication Primitives in a Polymorphic Language
We propose a method to extend an ML-style polymorphic language with transparent communication primitives, and give their precise operational semantics. These primitives allow any polymorphic programs de nable in ML to be used remotely in a manner completely transparent to the programmer. Furthermore, communicating programs may be based on di erent architecture and use di erent data representati...
متن کاملStructural Operational Semantics with transitivity rules and execution time
We define an structural operational semantics of the core of an imperative language. It has a measure in the transitions corresponding to the number of steps of evaluation that takes place in the transition (from the point of view of usual complexity theory) and transitivity rules that allow to prove in the theory what is usually proved in the meta-theory.
متن کامل